Analysing Finitely Presented Groups by Constructing Representations
نویسندگان
چکیده
منابع مشابه
Analysing Finitely Presented Groups by Constructing Representations
One idea how to prove that a finitely presented group G is infinite is to construct suitable homomorphisms into infinite matrix groups. In [HoP 92] this is done by starting with a finite image H of G and solving linear equations to check whether the epimorphism onto H can be lifted to a representation whose image is an extension of a ZZ-lattice by H, thus exhibiting an infinite abelian section ...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملConstructing Irreducible Representations of Finitely Presented Algebras
We describe an algorithmic test, using the “standard polynomial identity” (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n-dimensional representation. When ndimensional irreducible representations do exist, our proposed procedure can (in principle) produce explicit constructions.
متن کاملFinitely Presented Extensions by Free Groups
We prove here that a finitely presented group with a free quotient of rank n is an HNN-extension with n stable letters of a finitely generated group where the associated subgroups are finitely generated. This theorem has a number of consequences. In particular, in the event that the free quotient is cyclic it reduces to an elementary and quick proof of a theorem of Bieri and Strebel. 1. Finitel...
متن کاملFinitely Presented Residually Free Groups
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1997
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0131